A new construction for Williamson-type matrices

نویسنده

  • Jennifer Seberry
چکیده

It is shown that if q is a prime power then there are Williamson-type matrices of order (i) 1/2q2(q + 1) when q ≡ 1 (mod 4), (ii)1/4q2(q + 1) when q ≡ 3 (mod 4) and there are Williamson-type matrices of order l/4(q + 1). This gives Williamson-type matrices for the new orders 363, 1183, 1805, 2601, 3174, 5103. The construction can be combined with known results on orthogonal designs to give an Hadamard matrix of the new order 33396 = 4·8349. Disciplines Physical Sciences and Mathematics Publication Details Seberry, J, A new construction for Williamson-type matrices, Graphs and Combinatorics, 2, 1986, 81-87. This journal article is available at Research Online: http://ro.uow.edu.au/infopapers/1020 Graphs and Combinatorics 2, 81-87 (1986) Graphs alii Combinatorics © Springer_Verlag 1986 A New Construction for Williamson-type Matrices Jennifer Seberry· Department of Computer Science, University of Sydney, N.S.W., 2006, Australia Abstract. It is shown that if q is a prime power then there are Williamson-type matrices of order (i) !q2(q + t) when q == 1 (mod 4), (u) !q2(q + I) when q == 3 (mod 4) and there are Williamson-type matrices of order l(q + 1). This gives Williamson-type matrices for the new orders 363, 1183, 1805, 2601, 3174, 5103. The construction can be combined with known results on orthogonal designs to give an Hadamard matrix of the new order 33396 = 4·8349. It is shown that if q is a prime power then there are Williamson-type matrices of order (i) !q2(q + t) when q == 1 (mod 4), (u) !q2(q + I) when q == 3 (mod 4) and there are Williamson-type matrices of order l(q + 1). This gives Williamson-type matrices for the new orders 363, 1183, 1805, 2601, 3174, 5103. The construction can be combined with known results on orthogonal designs to give an Hadamard matrix of the new order 33396 = 4·8349.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semi-regular sets of matrices and applications

The concept of semi-regular sets of matrices was introduced by J. Seberry in "A new construction for Williamson-type matrices", Graphs and Combinatorics, 2(1986), 81-87. A regular s-set of matrices of order m was first discovered by J. Seberry and A. L. Whiteman in "New Hadamard matrices and conference matrices obtained via Mathon's construction", Graphs and Combinatorics, 4(1988), 355-377. In ...

متن کامل

Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture

We employ tools from the fields of symbolic computation and satisfiability checking— namely, computer algebra systems and SAT solvers—to study the Williamson conjecture from combinatorial design theory and increase the bounds to which Williamson matrices have been enumerated. In particular, we completely enumerate all Williamson matrices of even order up to and including 70 which gives us deepe...

متن کامل

Unified Particle Swarm Optimization for Hadamard matrices of Williamson type

In this work we apply the recently proposed Unified Particle Swarm Optimization (UPSO) method to the search for Hadamard matrices of the Williamson type. The objective functions that arise from the classical Williamson construction, are ideally suited for UPSO algorithms. This is the first time that swarm intelligence methods are applied to this problem. Mathematics Subject Classification (2000...

متن کامل

New skew-Hadamard matrices via computational algebra

In this paper we formalize three constructions for skew-Hadamard matrices from a Computational Algebra point of view. These constructions are the classical 4 Williamson array construction, an 8 Williamson array construction and a construction based on OD(16; 1, 1, 2, 2, 2, 2, 2, 2, 2), a 9-variable full orthogonal design of order 16. Using our Computational Algebra formalism in conjunction with...

متن کامل

The Quaternary Complex Hadamard Conjecture of order 2 n

ABSTRACT: In this paper, a complete construction of quaternary complex Hadamard matrices of order 2 n is obtained using the method of Sylvester construction and Williamson construction. Williamson construction has been generalized to obtain any kind of Hadamard matrices (Complex or Real Numbers). Non-equivalent family of Hadamard Matrices can be obtained using the Generalized Williamson constru...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 2  شماره 

صفحات  -

تاریخ انتشار 1986